Atomic Scale Grid for Modeling Semiconductor Structures and Fabrication Processes

ABSTRACT

Roughly described, a system for simulating a temporal process in a body includes a meshing module to impose a grid of nodes on the body, the grid having a uniform node spacing which is less than the quantum separation distance in silicon. A system of node equations is provided, including at least one node equation for each of a plurality of nodes of the grid. The node equations describe behavior of at least one physical quantity at that node through each time step of the process. An iterating module iterates through the time steps to determine values for physical quantities of the body at the end of the simulation period. Preferably one particle of the body is assigned to each node of the grid. For moving boundary processes, boundary movement can be represented simply by changing the particle type assigned to various nodes of the grid as the boundary advances.

REFERENCE TO PRIORITY APPLICATION

This application is a continuation of U.S. application Ser. No.14/479,070, filed Sep. 5, 2014, entitled “ATOMIC SCALE GRID FOR MODELINGSEMICONDUCTOR STRUCTURES AND FABRICATION PROCESSES” (Atty. Docket No.SYNP 2474-1), which is incorporated by reference herein in its entirety.

BACKGROUND

This invention relates to methods for modeling temporal processes in abody of material in computer aided design (CAD) and electronic designautomation (EDA) systems. For example it may be used to modelsemiconductor fabrication process steps or processes that occur duringdevice operation.

DESCRIPTION OF RELATED ART

Various methods can be used for modeling temporal processes in a body ofmaterial. Electron density, mechanical stress and deformation ofsemiconductor structures, and migration or diffusion of dopants anddefects, material reactions during or as results of a fabricationprocess step can be generally modeled by a continuity equation belowthat describes the conservation of a quantity q.

${\frac{dq}{dt} + {F \cdot {dS}}} = R$

In the continuity equation above, S is a closed surface enclosing avolume V.

dS a surface integral over the closed surface S. F is the flux of thequantity q or the amount of q flowing through a unit area of the surfaceper unit time. The continuity equation describes that the sum of thechange in the quantity per unit time

$\frac{dq}{dt}$

and the flux F of the quantity q flowing out of the surface S equals thenet rate R at which the quantity q increases (or decreases) within thevolume V. As examples, the conserved quantity q can be a number ofcharged carriers (electrons, holes), atoms, mass, energy, or momentum.

The continuity equation above can also be expressed as a partialdifferential equation:

${\frac{\partial d}{\partial t} + {\nabla{\cdot F}}} = r$

In the partial differential equation above, d is the density per unitvolume of the quantity q. (∇·) is the divergence operator thatrepresents the outward flux F of the quantity q from a unit volume(e.g., an infinitesimal volume). And r is the net rate that the quantityq increases (or decreases) per unit time per unit volume.

The continuity equations above describe the behavior of the quantity din a particular volume during the time period of interest. What istypically desired, however, are the values of d for numerous positionswithin a body being modeled, at the end of a particular period of timebeing modeled. Various methods can be used to determine these values.For example, a finite-difference method can be used for solving thecontinuity equation in the partial differential equation form. Insolving the continuity equation with the finite difference method, abody being modeled (e.g., the volume V above) is discretized into a gridof nodes, and the partial differential equation above is applicable toeach node of the grid. These equations, being dependent upon oneanother, form a system of simultaneous equations (sometimes referred toherein as “node equations”). The process is further discretized intodiscrete time steps from the beginning to the end of a process period ofinterest. Thus the finite-difference method involves solving the systemof node equations as a system of simultaneous equations, iterativelythrough discrete time steps of the process period of interest.

The solution of large sets of continuity equations is a cornerstone ofsemiconductor device design and characterization, as well assemiconductor fabrication process design and characterization.Established products that solve such equations are Sentaurus Device andSentaurus Process, respectively, both available from Synopsys, Inc.,Mountain View, Calif.

Bodies to be modeled often include boundaries. For example, a nano wireto be modeled has a substantially cylindrical shape, and has a boundaryalong its circumference at which the nano wire material meets air oranother external material. Such boundaries are rarely straight andrectangular. In addition, behavior of the process very near the boundarytypically must be modeled very carefully, while away from the boundarythe material can be assumed to behave more uniformly. Therefore, it iscommon to impose a grid of nodes on the body which is irregular,dividing the body much more finely near the boundaries and increasingthe grid size away from the boundary. Typically a triangular ortetrahedral grid of nodes is used, because those shapes are often goodat fitting curved boundaries. However, solving a system of partialdifferential equations such as the continuity equation using the finitedifference method and an irregular grid of nodes can result in anirregular matrix that requires more computing time and is difficult toparallelize. Moreover, for a moving-boundary problem such as in modelinga boundary between silicon and silicon oxide during a process step ofoxide growth, generation of a new grid of nodes for each time step canbe time consuming and troublesome.

SUMMARY

An opportunity arises to improve the way that processes occurring withrespect to a body are simulated.

Roughly described, a system for simulating a temporal process in a bodyincludes a meshing module to impose a grid of nodes on the body, thegrid having a uniform node spacing which is less than the quantumseparation distance in silicon. A system of node equations is provided,including at least one node equation for each of a plurality of nodes ofthe grid. The node equations describe behavior of at least one physicalquantity at that node through each time step of the process. Aniterating module iterates through the time steps to determine values forphysical quantities of the body at the end of the simulation period.Preferably one particle of the body is assigned to each node of thegrid. For moving boundary processes, boundary movement can berepresented simply by changing the particle type assigned to variousnodes of the grid as the boundary advances.

Aspects of the invention also apply to processes modeled by nodeequations other than partial differential equations, such as thediscrete time probability equations as used in Kinetic Monte Carlo (KMC)simulations of various processes. The technique is especially powerfulwhen used to model processes described with interrelated equations ofmore than one type.

The above summary of the invention is provided in order to provide abasic understanding of some aspects of the invention. This summary isnot intended to identify key or critical elements of the invention or todelineate the scope of the invention. Its sole purpose is to presentsome concepts of the invention in a simplified form as a prelude to themore detailed description that is presented later. Particular aspects ofthe invention are described in the claims, specification and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described with respect to specific embodimentsthereof, and reference will be made to the drawings, in which:

FIG. 1 is a flow chart of a method used by the system of FIG. 12 inmodeling semiconductor structures and fabrication process steps in a CADsystem.

FIG. 2 is a perspective view of a three-dimensional grid of nodes thatcan be used for the method of FIG. 1.

FIG. 3 is a perspective view of a nano wire.

FIG. 4 is a cross-sectional view of a grid of equally-spaced nodes formodeling a portion of a nano wire.

FIG. 5 is a perspective view of a nano wire on which has been imposed auniform grid of equally-spaced nodes.

FIG. 6 is a plot of electron density in a MOS-structure.

FIG. 7 illustrates examples of quantum separation.

FIG. 8 is a flow chart detail of the step in FIG. 1 for iterativelydetermining values for physical quantities of the body at the end of aplurality of time steps in a CAD system.

FIG. 9A is a visualization illustrating values of electron density in acylindrical silicon region of a nano wire as calculated by solving acontinuity equation using a uniform tensor product grid ofequally-spaces nodes.

FIG. 9B is a visualization illustrating values of electron density in acylindrical silicon region of a nano wire as calculated by solving acontinuity equation using a non-uniform grid with tetrahedral gridelements.

FIG. 10 is a simplified block diagram of a computer system.

FIG. 11 shows a simplified representation of an illustrative integratedcircuit design flow incorporating features of the technology.

FIG. 12 illustrates use of a system implementing aspects of theinvention in the related flow.

FIG. 13 is a flow chart detail of the step 840 in FIG. 8, in which twodifferent types of interrelated node equations are used.

DETAILED DESCRIPTION

The following description is presented to enable any person skilled inthe art to make and use the invention, and is provided in the context ofa particular application and its requirements. Various modifications tothe disclosed embodiments will be readily apparent to those skilled inthe art, and the general principles defined herein may be applied toother embodiments and applications without departing from the spirit andscope of the present invention. Thus, the present invention is notintended to be limited to the embodiments shown, but is to be accordedthe widest scope consistent with the principles and features disclosedherein.

Integrated Circuit Manufacturing Flow

FIG. 11 shows a simplified representation of an illustrative integratedcircuit design flow incorporating features of the technology. At a highlevel, the process starts with the product idea (step 1100) and isrealized in an EDA (Electronic Design Automation) software designprocess (step 1110). When the design is finalized, it can be taped-out(step 1140). After tape out, the fabrication process (step 1150) andpackaging and assembly processes (step 1160) occur resulting,ultimately, in finished integrated circuit chips (result 1170).

The EDA software design process (step 1110) is actually composed of anumber of steps 1112-1130, shown in linear fashion for simplicity. In anactual integrated circuit design process, the particular design mighthave to go back through steps until certain tests are passed. Similarly,in any actual design process, these steps may occur in different ordersand combinations. This description is therefore provided by way ofcontext and general explanation rather than as a specific, orrecommended, design flow for a particular integrated circuit.

A brief description of the components steps of the EDA software designprocess (step 1110) will now be provided.

System design (step 1112): The designers describe the functionality thatthey want to implement, they can perform what-if planning to refinefunctionality, check costs, etc. Hardware-software architecturepartitioning can occur at this stage. Example EDA software products fromSynopsys, Inc. that can be used at this step include Model Architect,Saber, System Studio, and DesignWare® products.

Logic design and functional verification (step 1114): At this stage, theVHDL or Verilog code for modules in the system is written and the designis checked for functional accuracy. More specifically, the design ischecked to ensure that produces the correct outputs in response toparticular input stimuli. Example EDA software products from Synopsys,Inc. that can be used at this step include VCS, VERA, DesignWare®,Magellan, Formality, ESP and LEDA products.

Synthesis and design for test (step 1116): Here, the VHDL/Verilog istranslated to a netlist. The netlist can be optimized for the targettechnology. Additionally, the design and implementation of tests topermit checking of the finished chip occurs. Example EDA softwareproducts from Synopsys, Inc. that can be used at this step includeDesign Compiler®, Physical Compiler, Test Compiler, Power Compiler, FPGACompiler, Tetramax, and DesignWare® products.

Netlist verification (step 1118): At this step, the netlist is checkedfor compliance with timing constraints and for correspondence with theVHDL/Verilog source code. Example EDA software products from Synopsys,Inc. that can be used at this step include Formality, PrimeTime, and VCSproducts.

Design planning (step 1120): Here, an overall floor plan for the chip isconstructed and analyzed for timing and top-level routing. Example EDAsoftware products from Synopsys, Inc. that can be used at this stepinclude Astro and IC Compiler products.

Physical implementation (step 1122): The placement (positioning ofcircuit elements) and routing (connection of the same) occurs at thisstep. Example EDA software products from Synopsys, Inc. that can be usedat this step include the Astro and IC Compiler products.

Analysis and extraction (step 1124): At this step, the circuit functionis verified at a transistor level, this in turn permits what-ifrefinement. Example EDA software products from Synopsys, Inc. that canbe used at this step include AstroRail, PrimeRail, Primetime, and StarRC/XT products.

Physical verification (step 1126): At this step various checkingfunctions are performed to ensure correctness for: manufacturing,electrical issues, lithographic issues, and circuitry. Example EDAsoftware products from Synopsys, Inc. that can be used at this stepinclude the Hercules product.

Tape-out (step 1127): This step provides the “tape out” data forproduction of masks for lithographic use to produce finished chips.Example EDA software products from Synopsys, Inc. that can be used atthis step include the CATS(R) family of products.

Resolution enhancement (step 1128): This step involves geometricmanipulations of the layout to improve manufacturability of the design.Example EDA software products from Synopsys, Inc. that can be used atthis step include Proteus, ProteusAF, and PSMGen products.

Mask data preparation (step 1130): This step provides the “tape-out”data for production of masks for lithographic use to produce finishedchips. Example EDA software products from Synopsys, Inc. that can beused at this step include the CATS(R) family of products.

A typical integrated circuit manufacturing flow also includes a relatedflow, as follows:

(1) Develop individual process steps for manufacturing the integratedcircuit. This can be modeled with the Synopsys tools “SentaurusProcess”, “Sentaurus Topography”, and “Sentaurus Lithography,” all usingaspects of the invention as described herein. The input information hereincludes process conditions like temperature, reactor ambient, implantenergy, etc. The output information is the changes in geometry or dopingprofiles or stress distribution. Aspects of the invention can be used inthis step of the manufacturing flow.

(2) Integrate the individual process steps into the complete processflow. This can be modeled with the Synopsys tool “Sentaurus Process”.The input information here includes the collection of the process stepsin the appropriate sequence. The output includes the geometry, thedoping profiles, and the stress distribution for the transistors and thespace in between the transistors. Aspects of the invention can be usedalso in this step of the manufacturing flow.

(3) Analyze performance of the transistor manufactured with this processflow. This can be done with the Synopsys tool “Sentaurus Device”. Theinput information here includes the output of step (2) and the biasesapplied to transistor terminals. The output information includes thecurrents and capacitances of the transistors for each bias combination.Aspects of the invention can be used also in this step of themanufacturing flow.

The output information developed in step (3) characterizes thetransistors made using the process, and the characteristics are thenprovided to circuit simulators such as HSPICE in order to permit adesigner to analyze circuit designs at a transistor level. By analyzingthe circuit at to transistor level, the designer is able to developbetter designs.

(4) If necessary, modify the process steps and the process flow toachieve the desired transistor performance. This can be done iterativelyby using the Synopsys tools mentioned above.

Once the process flow is ready, it can be used for manufacturingmultiple circuit designs coming from various designers in variouscompanies. The EDA flow 1112-1130 will be used by such designers. Theparallel flow described here can be used for example at a foundry todevelop a process flow that can be used to manufacture designs comingfrom the designers. A combination of the process flow and the masks madefrom step 1130 are used to manufacture any particular circuit. If thedesigners are at a different company, e.g. a fabless company, thenusually it is the foundry that performs this parallel process flowwhereas the process steps of FIG. 11 are performed typically by thefabless company. If the integrated circuit is manufactured at an IDM(integrated device manufacturer) company instead of the combination of afabless company and a foundry, then both parallel flows described aboveare done at the same IDM company.

There is also a bridge between these tools and the 1112-1130 EDA tools.The bridge is a Synopsys tool “Seismos” that applies compact proximitymodels for particular circuit design and layout to obtain netlist withinstance parameters for each individual transistor in the circuit as afunction of its neighborhood and stress, including material conversionstress. This netlist is used in the analysis step 1124.

FIG. 12 illustrates the use of a system implementing aspects of theinvention in the related flow. It can be used in several of the steps ofthe related flow. The system includes a meshing module 1210, whichreceives from a user a description of the body to be modeled, and theparameters to be used in imposing the mesh on the body. The body neednot be an entire structure (such as an entire transistor). In fact it isoften equally accurate and far more efficient to use only one quadrantor one octant of the overall structure, and establish reflectiveboundary conditions at the quadrant faces.

The meshing parameters include the coordinate range of the desired gridin each of the three dimensions, and a single value indicating theuniform spacing to be established between nodes in all three dimensions.Preferably, as described herein, the uniform spacing is no larger thanthe quantum separation distance in Silicon, and even more preferably iswithin 10% of the atomic size of a silicon atom. Even more preferably itis the same as the atomic size of a silicon atom. Also, preferably, thegrid dimensions are mutually orthogonal. Module 1210 is referred tosometimes herein as a “meshing” module, but it is often best to think ofthe mesh as merely implied by the grid nodes.

Module 1210 imposes the grid of nodes onto the body to be modeled, inthe sense that each node is assigned a position in or around the body. Anode data structure is populated for each node, which includes anindication of the position of the grid node in the body (in threedimensions), and values for various properties of the body at thatposition. In one embodiment the position of a node is identifiedexplicitly within the node's data structure, but in another embodimentthe node data structures are themselves organized into athree-dimensional array, with position of each node being implied by theuniform node spacing and the set of three array indices for the node.For some purposes (described elsewhere herein), for example if the bodymaterial is a crystal lattice structure whose lattice nodes do not matchthe exact positions of the grid nodes, the node data structure also mayinclude an indication of the position of the corresponding lattice node.

A “property”, as used herein, is a quantity applicable to each node.Properties include whatever properties are referenced in the nodeequations. Examples include relative permittivity and resistivity (forcertain types of device modeling), diffusivity (for certain types ofprocess modeling), and mechanical strength (for certain types ofmechanical modeling). Properties are usually fixed during the simulatedprocess, but sometimes they can change due to changes that take place atneighboring nodes. For example, if the oxygen concentration in theregion of a particular node increases, so that a silicon region beginsto behave more like SiO₂, then it might be appropriate to change theproperties of the particular node to those of SiO2 rather than pure Si.This situation can arise, for example, when modeling a SiO2 growthprocess, or another process that involves boundary movement. Propertiesusually are quantities of the material, but for certain types of nodeequations they might also include non-material quantities such asquantities of fields in the vicinity of a node. An example of the latteris electric field strength. Properties can also include externallyapplied quantities, such as those resulting at a particular nodeposition from an electric field applied externally to the body beingmodeled.

Meshing module 1210 outputs a description of the body with the imposedgrid of nodes. The output is in a predefined format. In one embodimentthe output is written to a non-transitory computer readable medium suchas a disk drive or computer memory.

The output of meshing module 1210 is provided to an iterating module1212, which may include a Technology Computer Aided Design (TCAD)module, such as Sentaurus Process, Sentaurus Topography, SentaurusLithography, or Sentaurus Device, all available from Synopsys, Inc.,Mountain View, Calif. Different ones of these tools would be used asiterating module 1212, depending on the particular type of temporalprocess to be modeled. The iterating module 1212 models the behavior ofa material structure during a time-varying process, by simulating thebehavior on a computer system. A user also provides the node equationsto iterating module 1212, starting values for various quantitiesreferenced in the node equations as well as time step parameters (suchas the duration of each time step and the maximum number of time stepsto calculate).

Iterating module 1212 provides as output an indication of the valuescalculated by the simulation, for the quantity or quantities ofinterest, as they are predicted to be at each node of the grid at theend of the simulation period. Like the output of meshing module 1210,the output of iterating module 1212 is provided in a predefined format.The output is reported to a user by a reporting module 1214. In oneembodiment the output is written to a non-transitory computer readablemedium such as a disk drive or computer memory, and in a furtherembodiment the output can be provided to a visualization module whichpresents the distribution of quantities across the body in a visual formwhich simplifies user interpretation of the results.

The results are then used, in various embodiments, for a variety of realworld aspects of building or improving integrated circuit devices. Inone embodiment, for example, the results are used to develop or improvea fabrication process flow that can be used to manufacture designs. Acombination of the process flow and the masks made from step 1130 areused to manufacture any particular circuit. In another embodiment theresults are used to characterize or improve transistors and otherdevices. In other embodiments the results are used to develop HSPICEmodels of integrated circuit devices, in order to enable designers todevelop better circuit designs and layouts. In yet other embodiments theresults are used to improve process flow to achieve the desiredtransistor performance. Thus the numerical values obtained by themethods and systems described herein are used for real worldtechnological development or implementation of semiconductormanufacturing processes or circuit designs.

FIG. 1 is a flow chart of a method used by the system of FIG. 12 inmodeling semiconductor structures and fabrication process steps in a CADsystem. The method of FIG. 1 can be implemented by one or more computingprocesses executing on one or more computer systems. At Step 110, themethod imposes a uniform grid of nodes on the body to be modeled. Thegrid has three independent dimensions and has a uniform node spacingwhich is less than the quantum separation distance in silicon. Step 110can be performed by meshing module 1210 (FIG. 12).

At step 112, a system of node equations is provided, describing behaviorof at least one physical quantity during a time step of the process tobe simulated. These node equations are provided to iterating module 1212(FIG. 12). The node equations in the system of node equations describethe behavior at a local level (i.e. at each node) through a discretetime step. The system of node equations need not be of only a singletype. In one particularly useful example, it may include both asub-system of partial differential equations and also a sub-system ofprobability equations. The term “system”, as used herein, thusencompasses a multiplicity of equations both because (1) each node hasat least one equation, and typically three (one for each axis); and also(2) there may be equations for more than one phenomenon at each node(e.g. a PDE (partial differential equation) and a probability equation).The equations for these different phenomena may be interrelated, in thesense that quantities determined by solving the equations for onephenomenon are used in solving the equations for the other phenomenonand vice-versa, but in some embodiments, for simplicity of computationthey are not all solved as a single system of simultaneous equations.The term “sub-system” is sometimes used herein to refer to a set ofequations that together make up a “system” of equations, but which arenot all solved together with other sub-systems as a single system ofsimultaneous equations. A “sub-system” of equations is itself consideredherein to constitute a “system” of equations. In some embodiments morethan two sub-systems of equations are included.

The system of node equations includes at least one node equation foreach node of the grid. The node equations describe the values of one ormore quantities of interest that will exist at the node at the end ofthe time step, as a function of (1) values of quantities at theparticular node and adjacent nodes at the beginning of the time step,(2) values of one or more properties of the material at the particularnode and possibly at nearby nodes, and (3) values of zero or moreadditional parameters established for purpose of the simulation. Thequantities described in the node equations can be any time varyingaspect of the structure which the simulation is intended to determine.In a simulation intended to find the distribution of dopantconcentration after an annealing step, for example, a quantity ofinterest might be the concentration of the dopant at each node at theend of the simulation. Other quantities of interest in variousembodiments include defect locations, material structures, electrondensity, current, capacitance, and mechanical stress. The quantities arephysical quantities, meaning they identify a value for some physicalaspect of the body of material at a particular time. Assuming adequateinstrumentation, these quantities can be measured. “Quantity” alsoincludes intermediate quantities, which are also physical. For example,in an embodiment which includes two subsystems of node equations,quantities determined in a particular time step by one sub-system mightbe considered intermediate quantities for purposes of the othersub-system.

At step 114, iterating module 1212 iterates through a first plurality oftime steps to determine values for at least a subset of the physicalquantities of the body at the end of the first plurality of time steps.

FIG. 2 is a perspective view of a three-dimensional grid of nodes thatcan be used for the method of FIG. 1. In this example, nodes 201 areplaced along the linear and independent x, y and z direction of aCartesian coordinate system. Each pair of adjacent nodes in the x, y, orz direction is spaced by an equal distance d. As used herein, the gridin FIG. 1 is referred to as a uniform grid because all of the Voronoivolumes have the same shape of polyhedrons (e.g., cubes with grid nodesin the middle of each cube) with the same size. The grid illustrated inFIG. 2 is used to model a three dimensional body. The boundaries andregions of the body itself may or may not align with a Cartesiancoordinate system.

FIG. 3 is a perspective view of an example three-dimensional structurethat can be modeled using a grid such as that of FIG. 2. In FIG. 3, thestructure is a nano wire. The nano wire can be a conductor (a conductingwire), but in FIG. 3 the nano wire is a transistor because a portion ofthe nano wire is surrounded by a gate stack structure (e.g., a gatedielectric and a metal gate). In particular, the nano wire includes aninner silicon cylindrical region 301 surrounded by a dielectric sheath,designated as layer 302. The diameter of the silicon cylindrical region301 is about 3 nanometers. The thickness of the dielectric layer 302 isabout 2 nanometers. The nano wire is surrounded by metal gate 303. Theportion of the nano wire between dashed lines 310 and 311 in FIG. 3 canbe modeled by a uniform grid of equally-spaced nodes such as the oneillustrated in FIG. 2.

FIG. 4 is a cross-sectional view of a grid of equally-spaced nodes formodeling the quadrant of the nano wire between dashed lines 310 and 311in FIG. 3. As shown in the example of FIG. 4, the grid includes nodesthat are equally spaced at the same distance d in the x and ydirections. Each node in the grid belongs to a particular one of thesilicon cylindrical region 301, the dielectric layer 302, or the metalgate region 303, as indicated by different shades of circles in FIG. 4.Because the nodes are equally spaced in the Cartesian coordinates, aboundary between nodes belonging to two different regions may notnecessarily follow the curved boundaries of the nano wire structure ofFIG. 3 (e.g., curved dashed lines shown in FIG. 4).

FIG. 5 is a perspective view of the nano wire of FIG. 3 on which hasbeen imposed a uniform grid of equally-spaced nodes in the x, y, and zdirections described above. As shown in FIG. 5, the boundary formedbetween nodes belonging to the silicon cylindrical region 301 and thedielectric layer 302, and the boundary formed between nodes belonging tothe dielectric layer 302 and the metal gate region 303, do not followthe cylindrical boundaries of the nano wire of FIG. 3.

In the grid illustrated in FIG. 4, each node is assigned values for oneor more properties (e.g., relative permittivity, resistivity, bandstructure, and mechanical properties) of the region to which the nodebelongs. For example, a node that belongs to the dielectric layer 302 isassigned one value for relative permittivity, whereas a node thatbelongs to the cylindrical silicon region 301 is assigned a differentvalue for relative permittivity. As another example, assuming forillustrative purposes that the silicon cylindrical region 301 is dopedwith phosphorus at a particular concentration, a node that belongs tothe cylindrical silicon region 301 may be assigned a particularcorresponding mobility value and a particular corresponding sheetresistivity value.

The property values assigned to individual nodes depend on the materialof the region to which the node belongs. However, several differentapproaches can be taken, either in a single embodiment or in differentembodiments, for determining the particular values to assign. In oneapproach, the property values assigned are those for the material of theregion in bulk. The material might be a structure containing only asingle atomic element (e.g. silicon), or it might be a structurecontaining only a single compound, or a mixture of particle types. Inthis approach the material is considered in bulk. For example, thematerial of the region to which a particular node belongs may besilicon, oxide, nitride, silicide, etc. In this first approach some orall of the property values to be assigned can be taken from known valuesfor bulk silicon, oxide, nitride silicide, etc. This approach mayrequire certain adjustments for regions having very small volume.

In a second approach, each node is assigned one particle type, and theproperty values assigned to the node derives from that particle type.For example, if the material in a particular region is a mixture of twoatomic elements, then in this second approach, some of the grid nodes inthe region are assigned to be one of the elements, and others areassigned to be the other element, and they are assigned to grid nodes inthe same ratio that they exist in the region. The property values forgrid nodes that are assigned to be the first element are assigned theproperty values of the first element, whereas the grid nodes that areassigned to be the second element are assigned the property values ofthe second element. This second approach requires that care be takenwhen assigning bulk material property values to individual grid nodes,because for certain kinds of material combinations the per-particleproperties may be meaningless. For SiO2, for example, the materialproperty values to assign to a particular grid node that is designatedto be silicon, should be based on the neighborhood of the silicon atomthat includes several adjacent atoms.

In a third approach, grid nodes in a particular region can be assignedproperty values which differ from each other in dependence upon aconcentration or other field strength at the particular grid node. Forexample, if the material in a region is not pure (e.g. a crystal latticestructure that includes dopant atoms), and the concentrations of theimpurities within the region are known, then instead of assigning thebulk material to most grid nodes and the impurities to the remainder ofthe grid nodes in the appropriate proportions, all the grid nodes can beassigned to be a composite material and an adjustment is made directlyin the translation to assigned property values. Thus in a region ofsilicon doped with a particular concentration of boron, the valueassigned to all the grid nodes in the region for resistivity may be aknown value for resistivity of bulk silicon with that same concentrationof boron. In some embodiments, if concentration of an impurity varies ina known manner within the region, the value assigned for a particularproperty may be made to vary accordingly among the various grid nodes.In addition to doped semiconductor materials, this third approach mayalso be useful for such quantities as electrostatic potential.

In all three of the above approaches, exactly one particle type isassigned to each grid node, but it is not necessary that the grid nodesbe located at the same positions as a corresponding particle in the bodybeing modeled. Note that as used herein, the term “particle type” alsoincludes vacancies, holes and defects in a crystal lattice structure.

An approach which assigns individual particles to individual grid nodesis greatly simplified where, as here, the grid node spacing approachesatomic sizes. In addition, such an approach can also greatly simplifysimulations of certain kinds of processes, such as processes whichinvolve moving boundaries between materials. For example, in anoxidation process to form SiO2, the boundary between the silicon regionand the oxide region moves as silicon is consumed and the oxide isformed. Such a process is very difficult to simulate accurately using anirregular grid of tetrahedrons, in part because of the need to re-meshthe boundary region after each time step. These difficulties are avoidedentirely in an approach which assigns individual particles to individualnodes of a uniform grid of atomic size, since when the boundary moves,the nodes that were previously assigned to be silicon atoms are nowsimply re-assigned to be SiO2 molecules (or one of the variations in theseveral approaches as described above). More particularly, for example,if after a particular time step the concentration of oxygen in theneighborhood of a particular grid node that had been assigned to besilicon, has increased above a predetermined threshold concentration,the grid node is simply re-assigned for the next time step to be a SiO2particle and the property values of SiO2 are applied instead of those ofsilicon. Other variations on this technique will be apparent to thereader.

The equal spacing between each pair of adjacent nodes of the grid in thex, y, and z directions in the embodiment of FIG. 2 is less than thequantum separation distance in silicon. Quantum separation is a quantummechanical phenomenon that the majority of electrons are located awayfrom the gate oxide interface of a metal-oxide-semiconductor (MOS)transistor in the inversion mode. According to classicalelectrodynamics, electron density is zero within the gate oxide, jumpsto its maximum value at the oxide-silicon interface, and gradually fadestoward the inside of the silicon. However, quantum mechanically, becauseelectrons (and holes) are more accurately described as probability wavesthat change continuously, electron density does not jump from zero toits maximum value at the oxide-silicon interface. Instead, electrondensity is zero at the oxide-silicon interface, reaches its peak valueat some particular distance into the silicon, and then gradually fadestoward the inside of the silicon. As used herein, the quantum separationdistance is the distance away from the oxide-silicon interface, at whichthe electron density centroid is located. It is known to be equal toabout 1-2 nanometers depending on the material. As dimensions oftransistor gate structures decrease to about only one to two orders ofmagnitude larger than atomic sizes, quantum effects such as quantumseparation become important.

FIG. 6 is a plot of electron density in a MOS-structure with 3 nanometergate oxide thickness, 5·10¹⁷ cm⁻³ boron doped channel, and <100>substrate orientation, at a gate voltage of 3 Volts. As shown in FIG. 6,quantum mechanically, the centroid of the electron density is close to 1nm away from the oxide-silicon interface. That is, the quantumseparation distance is close to 1 nm in this example. Because themajority of electrons are located away from the oxide-silicon interface,a measured value of the oxide thickness (e.g., as measured bycapacitance-voltage measurement methods) is larger than the classicalcase in which electron density is assumed to peak at the oxide-siliconinterface. Also, because of quantum separation, the threshold voltage ishigher than the classical case when the electron density peaks at theoxide-silicon interface. Quantum separation in silicon is discussed inmore detail in Andreas Wettstein, Quantum Effects in MOS Devices, Ph. D.Thesis, April 2000, Department of Information Technology and ElectricalEngineering, Eidgenössische Technische Hochschule (ETH) Zürich, which isherein incorporated by reference in its entirety.

FIG. 7 illustrates more examples of quantum separation. FIG. 7 shows acomparison among silicon (Si), germanium (Ge), and gallium arsenide(GaAs) in electron density away from an oxide-semiconductor interface ofa MOS transistor in the inversion mode. As shown in FIG. 7, a majorityof electrons are located away from the oxide-semiconductor interface.FIG. 7 shows that the quantum separation distance is about 1.1nanometers in silicon, 2.1 nanometers in Germanium, and 2.5 nanometersin gallium arsenide.

To account for the effect of quantum separation, it is advantageous tochoose the node spacing in the grid to be smaller than the quantumseparation distance in the particular semiconductor material. Otherwiseelectron density and related characteristics of the structure may not becalculated accurately. For example, a grid with an adjacent node spacinggreater than the quantum separation distance may yield an incorrectdistance to the electron density centroid in a MOS transistor in theinversion mode. Since the semiconductor so often of interest is silicon,preferably the node spacing in the grid is chosen to be smaller than thequantum separation distance in silicon.

More preferably, the equal distance d (in the x, y, or z direction)between each pair of adjacent nodes of the grid illustrated in FIGS. 2and 4 preferably is substantially the same as the atomic size ofsilicon, or 0.27 nanometers. That is, the grid is of atomic scale. Table1 below lists atomic sizes and densities of atoms commonly found insemiconductor structures. In Table 1, the atomic size is calculated asthe inverse cube root of the density. That is, the atomic size is theside of a cubic volume that on average an atom occupies in space. Theatomic size describes an average distance between a pair of adjacentatoms. As shown in Table 1, atomic sizes of these atoms and moleculesare different but within ±10% of 0.27 nanometers (the atomic size ofsilicon). Thus a grid with nodes equally spaced (in the x, y, and zdirection) at a spacing which is within ±10% of 0.27 nanometers (theatomic size of silicon) can be used to represent a semiconductorstructure with various atomic compositions having different atomicsizes. The distance 0.27 nanometers is also significantly less than thequantum separation distance in any of these materials, and thereforewill not cause the inaccuracies that can arise for grids with nodedistances larger than the quantum separation distance.

TABLE 1 Material Si Ge GaAs SiO₂ Si₃N₄ W MoS₂ Density 5e22 4.4e22 4.4e226e22 7e22 6e22 6e22 (atoms/cm3) Atomic Size 0.271 0.283 0.283 0.2550.243 0.255 0.255 (nm) Difference 0 +4% +4% −6% −10% −6% −6% with Si

Note that nodes in the grid illustrated in FIGS. 2 and 4 are arrangeddifferently from the crystal structures of the atoms and moleculescommonly found in semiconductor structures. For example, in a SiO₂crystal structure, an angle between two different silicon atomsconnected to the same oxygen atom can be 144°. In the grid illustratedin FIGS. 2 and 4, the angle between adjacent nodes is always 90° or180°. Although the distance between adjacent nodes in the grid issimilar to the distance between adjacent atoms in the body beingmodeled, there is no requirement that the exact position of the nodes inthe grid correspond to those atoms in the structure.

The grid described above with nodes equally spaced at a distance lessthan the quantum separation distance in silicon can be used for solvingpartial differential equations describing behavior of one or morequantities in a structure, such as the nano wire transistor illustratedin FIG. 3. For example, the partial differential equation can be acontinuity equation that describes a conserved quantity (e.g., chargedcarriers, atoms, mass, energy, momentum) in the nano wire structure. Thegrid is imposed on a body, which may be only a portion of the nano wirestructure (e.g., as illustrated in FIG. 4). The partial differentialequation is then solved iteratively and values are determined at eachnode in the grid for quantities modeled by the partial differentialequation (e.g., electron density, electron flux).

FIG. 8 is a flow chart detail of logic in step 114 (FIG. 1) foriteratively determining values for the physical quantities of the bodyat the end of a plurality of time steps in a CAD system. The logic ofFIG. 8 be implemented using processors programmed using computerprograms stored in memory accessible to the computer systems andexecutable by the processors, by dedicated logic hardware, includingfield programmable integrated circuits, or by combinations of dedicatedlogic hardware and computer programs. Each block in the flowchart mayrepresent in various embodiments a module, segment, or portion of code,which comprises one or more executable instructions (which may or maynot be contiguous) for implementing the specified logical function(s).As with all flowcharts herein, it will be appreciated that many of thesteps can be combined, performed in parallel or performed in a differentsequence without affecting the functions achieved. In some cases, as thereader will appreciate, a re-arrangement of steps will achieve the sameresults only if certain other changes are made as well. In other cases,as the reader will appreciate, a re-arrangement of steps will achievethe same results only if certain conditions are satisfied. Furthermore,it will be appreciated that the flow charts herein show only steps thatare pertinent to an understanding of the invention, and it will beunderstood that in a specific embodiment, numerous additional steps foraccomplishing other functions for that embodiment can be performedbefore, after and between those steps shown.

Each step illustrated in the flow chart describes logic that can beimplemented in hardware or in software running on one or more computingprocesses executing on one or more computer systems. Since mostsimulations of this type are extremely compute intensive, usuallyrequiring hours to perform on advanced computer hardware, at least someof the illustrated steps cannot reasonably be performed in the humanmind. In one embodiment, each step of the flow chart illustrates thefunction of a separate module of software. In another embodiment, thelogic of the step is performed by software code routines which aredistributed throughout more than one module.

In accordance with FIG. 1, prior to step 810, a grid of nodes alreadyhas been imposed on the body to be modeled, including assignment ofproperty values. The grid (e.g., as illustrated in FIG. 2) comprisesnodes that are placed in linear and independent directions at a uniformdistance that is less than the quantum separation distance in silicon.

The node equations also have already been determined and, in someembodiments, boundary conditions are established at certain nodes. Forexample, the method can assign values of zero fluxes at nodes at theboundaries of the grid (e.g., as for a reflective boundary condition).

In step 810, the method sets, at each node of the grid, for time step 0,starting values for one or more physical quantities of the nodeequation(s). For example, the method can set starting values of electrondensity at each node of the grid. Typically the starting values can beeither zero or certain equilibrium values that can be easily calculated.

For each successive time step 1, 2, 3, and so on (Step 830), the methoduses the node equations to calculate values for the physical quantitiesat the end of the current time step for each node (step 840). Forexample, if the node equations form a system of simultaneous equations(a finite set of equations in the same unknowns, of which the commonsolutions are to be determined), then the system can be solved using anyof a number of well-known methods for solving such a system of equations“as simultaneous equations.” For example, the system of node equationscan be transformed into a matrix system, in which an off-diagonalelement in the matrix system represents interactions (e.g., flux)between a pair of adjacent nodes in the grid. The matrix system at thecurrent time step then can be solved iteratively by a suitable numericalmethod such as the Gauss-Seidel method or Newton's method. Newton'sMethod, as well as some advantageous modifications thereof, aredescribed, for example, in U.S. Pat. No. 7,302,375, by inventorsKucherov and Moroz, Attorney Docket No. SYNP 0554-1, incorporated byreference herein. The method also records values of the quantities afterthe matrix system is solved for the current time step.

Similarly, if the node equations are probability equations describingthe probability of a particular event occurring at each node during thetime step, then random numbers can be generated and applied to the nodeequations to determine whether and/or to what extent the event will beconsidered to have occurred at that node during the current time step.

At Step 850, the method determines whether the solution at the currenttime step is satisfactory. For example, the method can determine whetherthe solution has converged within a specified threshold. If the solutionis satisfactory at the current time step, the method of FIG. 8 ends. Inaddition, the method can report to a user via a user interface the finalstate of the body (e.g., values of the quantities of interest at thegrid nodes). The report can take the form of numeric values, forexample, or a visualization such as those shown in FIGS. 3, 5, 9A or 9B.

If the solution at the current time step is not satisfactory, the methodupdates starting values of the quantities for the next time step (Step860). For example, the method can update starting values of thequantities for the next time step using the values determined for thequantities at the current time step. Then the method repeats the loop ofSteps 830, 840, 850, and 860, until a convergence condition is reached.Alternatively or additionally, the method can terminate the loop of Step830, 840, 850, and 860 after the iteration has been carried out for aspecified number of time steps as indicated in the time step parameters(FIG. 12).

FIG. 9A is a visualization illustrating values of electron density inthe cylindrical silicon region 301 of the nano wire of FIG. 3 ascalculated by solving Schrodinger's equation using the uniform tensorproduct grid of equally-spaced nodes described above. As shown in FIG.9A, the electron density is substantially zero near the oxide-siliconinterface.

FIG. 9B illustrates values of electron density in the cylindricalsilicon region 301 of the nano wire of FIG. 3 as calculated by solvingSchrodinger's equation using a non-uniform grid with a tetrahedral gridof nodes. FIG. 9B shows quantitatively similar results as FIG. 9A. FIG.9B has finer resolution, but because of the non-uniform grid that leadsto irregular sparse matrix, computation of electron density values inFIG. 9B would require far more computing time than computation ofelectron density values in FIG. 9A with the uniform tensor product grid.

KMC Embodiments

The above-described techniques can be used for simulating a variety ofdifferent phenomena, modeled with a variety of different types of nodeequations. Processes involving particle movement or chemical reactions,for example, often are best modeled using discrete time probabilityequations. The KMC method is a Monte Carlo computer simulation methodthat simulates time evolution of certain processes occurring at a knownrate, modeled by such discrete time probability equations. See A. F.Voter, Introduction to the Kinetic Monte Carlo Method, in RadiationEffects in Solids, edited by K. E. Sickafus, E. A. Kotomin and B. P.Uberuaga (Springer, NATO Publishing Unit, Dordrecht, The Netherlands,2007) pp. 1-23, incorporated by reference herein.

In a KMC method, events are modeled as having a predefined probabilityof occurring per unit time. For modeling a dopant diffusion process, forexample, there is a known probability at which a dopant atom will jumpin each direction during a particular time step. The probabilityincreases with increasing temperature. The probability per time step,which can also be thought of as a frequency of occurrence f, is givenby:

${f = {A \cdot {\exp \left( \frac{- E_{a}}{kT} \right)}}},$

where

-   -   A is a pre-factor that is determined by the properties of a        material where the event is occurring and the properties of the        particle under consideration;    -   E_(a) is an activation energy of the event, such as the energy        barrier for the particle jumping from one location to the next;    -   k is Boltzmann's constant, and    -   T is temperature

Thus to model a process in which events occur randomly, with a frequencythat depends on the values of certain properties of the particle ofinterest and properties of the local material, an embodiment might usediscrete time probability equations as the node equations, rather thandiscrete time continuity equations. The node equations apply at eachgrid node, and the parameters of the node equation (A, E_(a) and T inthe above example) are assigned values based on the material andconditions extant at each grid node. The time step for the simulation istypically chosen based on the time scale at which the event is likely tooccur. If multiple concurrent random processes are to be modeled, thenthe time step for the simulation is typically chosen based on the timescale at which the most frequent event is likely to occur.

In the past, KMC methods have typically not involved an imposed grid ofnodes in the sense described herein. Rather, particles were assignedtheir actual (simulated) positions within the body. For example,simulations of dopant diffusion through a base material typicallyassumed that dopant particles would jump from one position to another inthe base material, neither of which positions are necessarily related tothe positions of any imposed grid of nodes. Often the probability of theevent would depend on the Euclidean distance to an adjacent particle,which can be time consuming to calculate.

According to an aspect of the present invention, on the other hand, auniform grid of nodes is imposed on the body, with atomic scale nodespacing as set forth above. The node equations are discrete timeprobability equations, but in most cases the calculations are simplifiedby assuming that all particles lie at grid nodes. Thus in most cases thedistance between particles is simply the uniform, predetermined nodespacing. It can be seen that the imposition of an atomic scale uniformgrid can greatly speed the determination of physical quantities at theend of each time step for each node (step 840).

The simplification that all particles lie at grid nodes can yield highaccuracy for most regions of the body being modeled. The simplificationmay not be as valid, however, at or near material boundaries. Therefore,in an aspect of the invention, the grid node data structure alsoidentifies the actual position of the particle assigned to each gridnode. For most purposes the grid node position is used in thecalculations. But for grid nodes that lie within a predeterminedneighborhood near a boundary, the actual positions of the particles areused to calculate the distance between particles. For example, if thenode equations depend on the distances to only the immediately adjacentparticles, iterating module 1212 can determine that a particular gridnode is within the predetermined neighborhood of a boundary by detectingthat the particle type assigned to any immediately adjacent grid nodediffers from the particle type assigned to the particular grid node.Similarly, if the node equations depend on the distances to the adjacentparticles and also to the particles located one node beyond the adjacentparticles, then iterating module 1212 can determine that a particulargrid node is within the predetermined neighborhood of a boundary bydetecting that any grid node lying within two nodes of the particulargrid node is assigned a particle type which differs from the particletype assigned to the particular grid node. Thus as used herein, the term“boundary neighborhood” is co-extensive with the reach of the relevantnode equations. Note that a particular embodiment might use actualparticle positions rather than grid node positions even for certain gridnodes outside the boundary neighborhood, though such an embodiment mightsacrifice some speed without significant improvement in accuracy.

For certain kinds of KMC-modeled processes, one is interested only inthe movement of a subset of the particle types. For example, whenmodeling an impurity diffusion processes, usually the user is interestedonly in the movement of impurity particles, and not the movement ofparticles of the base material. This kind of simulation can bestreamlined by evaluating node equations only where the particularparticles of interest are likely to occur. So in the impurity diffusionexample, if the impurity concentration in a particular region is only1%, then node equations for only 1% of the grid nodes need be evaluated.In various embodiment, this subset of grid nodes can be selectedrandomly or can be selected to be distributed uniformly throughout theregion, or with an appropriate gradient. The selected subset of gridnodes are given node equations describing the probability that theimpurity particle will jump from one grid node in the subset to another.No node equations need be applied to the other 99% of the grid nodesbecause those equations are not evaluated. Alternatively, if the nodeequations at all grid nodes will be evaluated, those grid nodes not inthe selected subset can be assigned node equations that evaluate tozero. Other ways of disregarding the effect of node equations at gridnodes not in the selected subset, or reducing the computational effortfor such node equations, will be apparent to the reader.

Modeling Multiple Phenomena with Interrelated Sub-Systems of NodeEquations

KMC can be used to model more than one probabilistic phenomenon in playin the same body. For example, while the above equation can be used tomodel particle jumping probabilities, another equation can be used tomodel the likelihood that two adjacent particles will react to form adifferent particle type. In an embodiment modeling multiple mutuallyinterrelated probabilistic phenomena in play concurrently in the samebody, the system of node equations can be provided as multiplesub-systems of node equations. These multiple sub-systems of nodeequations can be resolved in sequential round-robin fashion within eachtime step (i.e. within a single instance of step 840). Moreparticularly, if there are three subsystems of node equations, then step840 can involve first determining values for the physical quantities atthe end of the current time step for each node using only the firstsubsystem of node equations, based on values existing as a result of theprior complete time step; then determining values for the physicalquantities at the end of the current time step for each node using onlythe second subsystem of node equations, based on values existing as aresult of the first sub-system of node equations; and then determiningvalues for the physical quantities at the end of the current time stepfor each node using only the third subsystem of node equations, based onvalues existing as a result of the second sub-system of node equations.It is a simplification to assume that the values determined as a resultof the first and/or second sub-systems of node equations are accuratestarting values for the second and/or third sub-system of nodeequations, but the simplification can be valid with sufficiently shorttime steps.

In addition, the use of an atomic scale uniform grid can also greatlysimplify the simulation of a process involving multiple mutuallyinterrelated phenomena in play concurrently in the same body, eachmodeled using different types of node equations. In particular, onephenomenon can be modeled as a set of discrete time continuityequations, for which the node equations are partial differentialequations, while another phenomenon is modeled as a random process, forwhich the node equations are discrete time probability equations.

As an example of a simulation problem involving two interrelatedphenomena modeled by these two different types of equations, considerrandom particle drift of charged particles arising due to an electricfield. If the particles were neutral, or if they were charged but therewas no electric field, then what results is diffusion. The jumpingfrequency is isotropic and as set forth above, its frequency f is givenby:

${f = {A \cdot {\exp \left( \frac{- E_{a}}{kT} \right)}}},$

If the particles are charged and there is an electric field, then inaddition to random diffusion there is also a drift driven by the field.The jumping frequency is no longer isotropic, and is given by:

${f = {A \cdot {\exp \left( \frac{{- E_{a}} + {\Delta E}}{kT} \right)}}},$

where ΔE is the change to the diffusion barrier due to the field:

ΔE=±E·λ,

where λ is the particle jumping distance (which, as previouslydescribed, can be simplified to be equal to the uniform spacing betweengrid nodes, except in the neighborhood of material boundaries where theactual distances may be used). In a given dimension of the grid, ΔE ispositive for one direction and negative for the opposite direction,thereby rendering the likelihood of a jump in one direction to begreater than the likelihood of a jump in the opposite direction. Thenon-isotropic jumping frequency is what gives rise to drift.

But the positions of the charged particles affect the electric field inthe body. Poisson's Equation can be used to obtain electric field E andelectrostatic potential φ from charge distribution q:

∇²ϕ=q,

where ∇² is the double differentiation over x, y and z. The electricfield E is a derivative of the electrostatic potential φ:

E=∇ϕ.

The electric field at each grid node is best calculated by solving asystem of partial differential equations. Thus the simulation probleminvolves two interrelated phenomena, one modeled as a system of partialdifferential equations, while the other is modeled as a random processbest described by a system of discrete time probability equations.

FIG. 13 is a flow chart detail of step 840 (FIG. 8), in which these twotypes of interrelated node equations are used. In step 1310, in thefirst time step of the simulation, the sub-system of partialdifferential equations describing the electric field is solved as a setof simultaneous equations based on starting values. In step 1312,quantities from the sub-system of discrete time probability equationsmodeling particle diffusion and drift are determined for the currenttime step using a KMC method, based on quantities previously determinedby solving the sub-system of partial differential equations in step1310. Any required re-assignment of particle types to particular nodesas described above can be performed as part of step 860 for the nextiteration of step 840. In the second and subsequent time steps, in step1310, the sub-system of partial differential equations is again solvedas a set of simultaneous equations based on quantities determined in theimmediately preceding iteration of step 1312. In step 1312, quantitiesfrom the sub-system of discrete time probability equations modelingparticle diffusion and drift are again determined using the KMC method,based on quantities previously determined by the immediately precedingiteration of step 1310, and so on. This type of multiple equation-typesimulation can be difficult to perform without an atomic scale uniformgrid imposed on the body and used for both types of equations. Note thatin a variation of the embodiment of FIG. 13, the two steps 1310 and 1312can be interchanged. Also, note that if a moving boundary is involved inthe simulation, then a step 1314 (shown in broken lines in FIG. 13) canfollow the KMC step 1312. In step 1314, the moving boundary isaccommodated merely by re-assigning particle types to the fixed gridnodes as appropriate, based on the changes in relevant quantitiesdetermined by the KMC step 1312 in the current time step.

As described above, the determination of quantities from differentsub-systems of equations is considered to occur during separate,sequential time sub-steps of each full time step. This can be thought ofas involving two pluralities of time sub-steps interspersed with eachother. In a variation, some or all of the time sub-steps may bepipelined or performed in parallel. Note that it is the time sub-stepsrepresented by each calculation which are considered sequential, not thetime periods during which the calculations are actually performed.Additionally, if the time sub-steps are considered divided into two ormore pluralities of time sub-steps, though it is preferred that they beinterspersed one-to-one (or round-robin if there are more than two),that is not absolutely essential. In one embodiment, the two or morepluralities of time steps are asynchronous with each other. Each nodeequation is a function of the most recent values obtained from the othersub-system(s) of node equations, even if some of the values weredetermined more than one integer time step previously.

In yet another embodiment, the determination of quantities in a singletime step from different sub-systems of equations can occurindependently of each other. In such an embodiment all the sub-systemsof equations can be evaluated based on values calculated for the end ofthe prior full time step. In this embodiment the different sub-systemsof equations can be evaluated in parallel on different hardware, andthere would be no need to keep track of time sub-steps or intermediateresults. Again, though it is a simplification to assume that the valuescalculated for the end of the prior full time step are accurate startingvalues for all of the sub-systems of node equations, the simplificationcan be valid with sufficiently short time steps.

Further, it is preferable that different sub-systems of node equationsused conjunctively to model a process all use the same grid of nodes.However, in a variation, different sub-systems of node equations coulduse different grids, though it would be preferable if all nodes of onegrid coincide with nodes of the other grid in order to avoid sacrificingbenefits of the uniform grid. For example, one sub-system of equationsmight include one node equation for each node of its grid, whereasanother sub-system of node equations might have only one node equationfor every second node in each dimension of the first system's grid (i.e.⅛ the number of node equations). Other variations will be apparent.

Computer System

FIG. 10 is a simplified block diagram of a computer system 1010 suitablefor use with embodiments of the technology. For example, meshing module1210 and iterating module 1212 may be implemented using computer systems1010. Computer system 1010 typically includes at least one processor1014 which communicates with a number of peripheral devices via bussubsystem 1012. These peripheral devices may include a storage subsystem1024, comprising a memory subsystem 1026 and a file storage subsystem1028, user interface input devices 1022, user interface output devices1020, and a network interface subsystem 1016. The input and outputdevices allow user interaction with computer system 1010. Networkinterface subsystem 1016 provides an interface to outside networks,including an interface to communication network 1018, and is coupled viacommunication network 1018 to corresponding interface devices in othercomputer systems. Communication network 1018 may comprise manyinterconnected computer systems and communication links. Thesecommunication links may be wireline links, optical links, wirelesslinks, or any other mechanisms for communication of information. Whilein one embodiment, communication network 1018 is the Internet,communication network 1018 may be any suitable computer network.

User interface input devices 1022 may include a keyboard, pointingdevices such as a mouse, trackball, touchpad, or graphics tablet, ascanner, a touchscreen incorporated into the display, audio inputdevices such as voice recognition systems, microphones, and other typesof input devices. In general, use of the term “input device” is intendedto include all possible types of devices and ways to input informationinto computer system 1010 or onto communication network 1018.

User interface output devices 1020 may include a display subsystem, aprinter, a fax machine, or non-visual displays such as audio outputdevices. The display subsystem may include a cathode ray tube (CRT), aflat-panel device such as a liquid crystal display (LCD), a projectiondevice, or some other mechanism for creating a visible image such asthose of FIGS. 6, 7, 9A, and 9B. The display subsystem may also providenon-visual display such as via audio output devices. In general, use ofthe term “output device” is intended to include all possible types ofdevices and ways to output information from computer system 1010 to theuser or to another machine or computer system. Visualizations ofquantities determined by the techniques herein may be presented on someof these output devices.

Storage subsystem 1024 stores the basic programming and data constructsthat provide the functionality of some or all of the embodimentsdescribed herein, including the methods for solving a partialdifferential equation in modeling semiconductor structures andfabrication process steps with an atomic-scale grid. These softwaremodules are generally executed by processor 1014, to implement the logicof the methods described herein.

Memory subsystem 1026 typically includes a number of memories includinga main random access memory (RAM) 1030 for storage of instructions anddata during program execution and a read only memory (ROM) 1032 in whichfixed instructions are stored. File storage subsystem 1028 providespersistent storage for program and data files, and may include a harddisk drive, a floppy disk drive along with associated removable media, aCD-ROM drive, an optical drive, or removable media cartridges. Thedatabases and modules implementing the functionality of certainembodiments may be stored by file storage subsystem 1028.

Bus subsystem 1012 provides a mechanism for letting the variouscomponents and subsystems of computer system 1010 communicate with eachother as intended. Although bus subsystem 1012 is shown schematically asa single bus, alternative embodiments of the bus subsystem may usemultiple busses.

Computer system 1010 itself can be of varying types including a personalcomputer, a portable computer, a workstation, a computer terminal, anetwork computer, a television, a mainframe, or any other dataprocessing system or user device. Due to the ever-changing nature ofcomputers and networks, the description of computer system 1010 depictedin FIG. 10 is intended only as a specific example for purposes ofillustrating the preferred embodiments. Many other configurations ofcomputer system 1010 are possible having more or less components thanthe computer system depicted in FIG. 10.

As used herein, a given event or value is “responsive” to a predecessorevent or value if the predecessor event or value influenced the givenevent or value, or if it is a function of the predecessor event orvalue. If there is an intervening processing element, step or timeperiod, the given event or value can still be “responsive” to thepredecessor event or value. If the intervening processing element orstep combines more than one event or value, the signal output of theprocessing element or step is considered “responsive” to each of theevent or value inputs. If the given event or value is the same as thepredecessor event or value, this is merely a degenerate case in whichthe given event or value is still considered to be “responsive” to thepredecessor event or value. “Dependency” of a given event or value uponanother event or value is defined similarly.

As used herein, the “identification” of an item of information does notnecessarily require the direct specification of that item ofinformation. Information can be “identified” in a field by simplyreferring to the actual information through one or more layers ofindirection, or by identifying one or more items of differentinformation which are together sufficient to determine the actual itemof information. In addition, the term “indicate” is used herein to meanthe same as “identify”.

The applicant hereby discloses in isolation each individual featuredescribed herein and any combination of two or more such features, tothe extent that such features or combinations are capable of beingcarried out based on the present specification as a whole in light ofthe common general knowledge of a person skilled in the art,irrespective of whether such features or combinations of features solveany problems disclosed herein, and without limitation to the scope ofthe claims. The applicant indicates that aspects of the presentinvention may consist of any such feature or combination of features. Inview of the foregoing description it will be evident to a person skilledin the art that various modifications may be made within the scope ofthe invention.

The foregoing description of preferred embodiments of the presentinvention has been provided for the purposes of illustration anddescription. It is not intended to be exhaustive or to limit theinvention to the precise forms disclosed. Obviously, many modificationsand variations will be apparent to practitioners skilled in this art.For example, while constant duration time steps are useful in someembodiments, other embodiments might use time steps which vary duringthe course of a simulation. In particular, and without limitation, anyand all variations described, suggested or incorporated by reference inthe Background section of this patent application are specificallyincorporated by reference into the description herein of embodiments ofthe invention. In addition, any and all variations described, suggestedor incorporated by reference herein with respect to any one embodimentare also to be considered taught with respect to all other embodiments.The embodiments described herein were chosen and described in order tobest explain the principles of the invention and its practicalapplication, thereby enabling others skilled in the art to understandthe invention for various embodiments and with various modifications asare suited to the particular use contemplated. It is intended that thescope of the invention be defined by the following claims and theirequivalents.

1. A computer readable medium having stored thereon in a non-transitorymanner, a plurality of software code portions defining logic forsimulating a temporal process in a body, the logic comprising: imposinga uniform grid of nodes on the body, the grid having three independentdimensions and having a uniform node spacing which is less than thequantum separation distance in silicon; providing a system of nodeequations, including at least one node equation for each of a pluralityof nodes of the grid, the node equation or equations for each particularone of the nodes describing behavior of at least one physical quantityof the body at the particular node through each of a first plurality oftime steps of the process; and iterating through the first plurality ofthe time steps to determine values for at least a subset of the physicalquantities of the body at the end of the first plurality of time steps.2. The computer readable medium of claim 1, wherein the temporal processcomprises a semiconductor fabrication process step.
 3. The computerreadable medium of claim 1, wherein the temporal process comprisescharge movement in a semiconductor material.
 4. The computer readablemedium of claim 1, wherein the uniform node spacing is a value that iswithin 10% of 0.27 nanometers.
 5. The computer readable medium of claim4, wherein the uniform node spacing is 0.27 nanometers.
 6. The computerreadable medium of claim 1, wherein the three independent dimensions aremutually orthogonal.
 7. The computer readable medium of claim 1, whereinthe system of node equations includes a system of discrete timeprobability equations, and wherein iterating through a first pluralityof time steps comprises, at each time step in the first plurality oftime steps, randomly determining a particle quantity change at eachparticular one of the nodes in the plurality of nodes in accordance withthe probability equation for the particular node.
 8. The computerreadable medium of claim 7, wherein the plurality of nodes of the gridincludes all nodes of the grid.
 9. The computer readable medium of claim7, wherein the system of node equations further includes a system ofdiscrete time continuity equations, at least one of the discrete timecontinuity equations for each node of the grid, and wherein the codeportions further define logic for iterating through a second pluralityof the time steps, and at each time step in the second plurality of timesteps, solving the system of continuity equations as a set ofsimultaneous equations.
 10. The computer readable medium of claim 1,wherein the system of node equations includes a system of first nodeequations each describing behavior of a first physical quantity of thebody at each of the nodes in the plurality of nodes through each timestep in the first plurality of time steps, and a system of second nodeequations each describing behavior of a second physical quantity of thebody at each of the nodes in a second plurality of the nodes of the gridthrough each time step in a second plurality of time steps of theprocess, each of the first node equations being dependent upon values ofthe second physical quantity and each of the second node equations beingdependent upon values of the first physical quantity, and wherein thecode portions further define logic for iterating through the secondplurality of the time steps to determine values for the second physicalquantity of the body at the end of a second plurality of time steps. 11.The computer readable medium of claim 10, wherein at least one of thetime steps in the second plurality of time steps differs from all of thetime steps in the first plurality of time steps.
 12. The computerreadable medium of claim 10, wherein the second plurality of time stepsis interspersed with the first plurality of time steps, and wherein theiteration through the second plurality of time steps alternates with theiteration through the first plurality of time steps.
 13. The computerreadable medium of claim 10, wherein the system of first node equationscomprises a system of discrete time continuity equations, at least oneof the discrete time continuity equations for each node of the grid, andwherein the system of second node equations comprises a system ofdiscrete time probability equations, at least one of the discrete timeprobability equations for each node of the grid.
 14. The computerreadable medium of claim 1, wherein the body comprises a plurality ofdifferent particle types, each having different values for at least afirst material property, at least one of the node equations beingdependent upon the value for the first material property at each of thenodes, and wherein imposing a uniform grid of nodes on the bodycomprises assigning exactly one particle of the body to each of thenodes.
 15. The computer readable medium of claim 14, wherein a firstportion of the grid is imposed on a first portion of the body, the firstportion of the body having particles disposed in a crystal latticestructure whose node positions differ from the node positions in thefirst portion of the uniform grid.
 16. The computer readable medium ofclaim 14, wherein a first one of the particle types comprises a moleculehaving a plurality of constituent atoms, and wherein assigning exactlyone particle of the body to each of the nodes comprises assigning oneinstance of the molecule to each of a number of the nodes.
 17. Thecomputer readable medium of claim 14, wherein a first portion of thegrid is imposed on a portion of the body composed essentially ofmultiple instances of a first compound, the first compound having aplurality of constituent elements in a particular ratio, and whereinassigning exactly one particle of the body to each of the nodescomprises assigning the constituent elements individually to the nodesin the first portion of the grid in the same proportion as theparticular ratio.
 18. The computer readable medium of claim 14, whereina first portion of the grid is imposed on a portion of the body composedessentially of a mixture of particles of a plurality of types inrespective particle ratios, and wherein assigning exactly one particleof the body to each of the nodes comprises assigning the particles ofthe mixture individually to the nodes in the first portion of the gridin the same proportions as in the mixture.
 19. The computer readablemedium of claim 1, wherein the code portions further define logic forreporting to a user values determined for the subset of physicalquantities at one or more nodes in the grid.
 20. A computer readablemedium having stored thereon in a non-transitory manner, a plurality ofsoftware code portions defining logic for simulating a temporal processin a body, the body comprising particles of a plurality of differentparticle types each having a different value for at least a firstmaterial property, the logic comprising: assigning exactly one particleof the body to each of a plurality of nodes in a uniform grid of nodesimposed on the body, the grid having three independent dimensions andhaving a uniform node spacing; providing a system of discrete timeprobability node equations, at least one of the node equations for eachof the plurality of nodes of the grid, each of the node equationsdescribing probability of a predetermined physical event type occurringat the respective node of the grid during a predetermined time period,in dependence upon the value for the first material property of theparticle assigned to the respective node; and iterating through a firstplurality of time steps in a simulation period, at each time stepdetermining a physical quantity of the body at each of the nodes in theplurality of nodes at the end of the particular time step in dependenceupon the node equations and values of the physical quantity at thebeginning of the particular time step, to determine values for thephysical quantity of the body at the end of the simulation period. 21.The computer readable medium of claim 20, wherein a first one of theparticle types comprises a molecule having a plurality of constituentatoms, and wherein assigning exactly one particle of the body to each ofthe nodes comprises assigning one instance of the molecule to each of anumber of the nodes.
 22. The computer readable medium of claim 20,wherein a first portion of the grid is imposed on a portion of the bodycomposed essentially of multiple instances of a first compound, thefirst compound having a plurality of constituent elements in aparticular ratio, and wherein assigning exactly one particle of the bodyto each of the nodes comprises assigning the constituent elements to thenodes in the first portion of the grid in the same proportion as theparticular ratio.
 23. The computer readable medium of claim 20, whereina first portion of the grid is imposed on a portion of the body composedessentially of a mixture of particles of a plurality of types inrespective particle ratios, and wherein assigning exactly one particleof the body to each of the nodes comprises assigning the particles ofthe mixture to the nodes in the first portion of the grid in the sameproportions as in the mixture.
 24. The computer readable medium of claim20, wherein a first portion of the grid is imposed on a first portion ofthe body, the first portion of the body having particles disposed in acrystal lattice structure whose node positions differ from the nodepositions in the first portion of the uniform grid.
 25. The computerreadable medium of claim 24, wherein assigning exactly one particle ofthe body to each node comprises storing in the computer system, inassociation with each node in the first portion of the grid, anidentification of an actual position in the body of the particleassigned to the respective node of the grid.
 26. The computer readablemedium of claim 25, wherein one of the node equations is dependent upona distance to an adjacent particle, and wherein in iterating through afirst time step in the first plurality of time steps the iteratingmodule, for the node equation corresponding to a first one of the nodesof the grid, approximates the distance to an adjacent particle as thedistance between the first node and the grid node to which the adjacentparticle is assigned.
 27. The computer readable medium of claim 25,wherein one of the node equations is dependent upon a distance to anadjacent particle, and wherein in iterating through a first time step inthe first plurality of time steps the iterating module, for the nodeequation corresponding to a first one of the nodes of the grid,determines the distance to an adjacent particle in dependence upon theactual particle positions as stored in association with the first nodeand the grid node to which the adjacent particle is assigned.
 28. Thecomputer readable medium of claim 25, wherein one of the node equationsis dependent upon a distance to an adjacent particle, and whereiniterating through a first time step in the first plurality of time stepscomprises: determining, for the node equation corresponding to eachgiven node in at least a subset of the grid nodes, whether the givennode is within a predetermined boundary neighborhood of a materialboundary; if the given node is within the predetermined boundaryneighborhood of a material boundary, for the node equation correspondingto the given node, determining the distance to an adjacent particle independence upon the actual particle positions as stored in associationwith the given node and the node to which the adjacent particle isassigned; and if the given node is not within the predetermined boundaryneighborhood, for the node equation corresponding to the given node,approximating the distance to the adjacent particle as the distancebetween the given node and the grid node to which the adjacent particleis assigned.
 29. The computer readable medium of claim 20, wherein thecode portions further define logic for reporting to a user valuesdetermined for the subset of physical quantities at one or more nodes inthe grid.
 30. A computer readable medium having stored thereon in anon-transitory manner, a plurality of software code portions defininglogic for simulating a temporal process in a body having a plurality ofdifferent particle types, each particle type having different values forat least a first material property, the logic comprising: imposing auniform grid of nodes on the body, including assigning exactly oneparticle of the body to each of the nodes, the grid having threeindependent dimensions and having a uniform node spacing; providing asystem of node equations, including at least one node equation for eachof a plurality of nodes of the grid, the node equation or equations foreach particular one of the nodes describing behavior of at least onephysical quantity of the body at the particular node in dependence uponthe value for the first material property at the particular node througheach of a first plurality of time steps of the process; and iteratingthrough the first plurality of the time steps to determine values for atleast a subset of the physical quantities of the body at the end of thefirst plurality of time steps.
 31. The computer readable medium of claim30, wherein iterating through a first plurality of time steps comprises,for a subject one of the time steps in the first plurality of timesteps: determining a particle quantity change at one or more nodes ofthe grid in a neighborhood of a subject one of the nodes of the grid;and re-assigning to the subject node a particle of the body selected independence upon the particle quantity changes.
 32. The computer readablemedium of claim 30, wherein the node equations for each of the pluralityof nodes of the grid are discrete time probability equations describingprobability of a predetermined physical event type occurring at therespective node of the grid during a predetermined time period, thepredetermined physical event type causing a particle quantity change atone or more nodes of the grid.
 33. The computer readable medium of claim30, wherein a first portion of the grid is imposed on a first portion ofthe body, the first portion of the body having particles disposed in acrystal lattice structure whose node positions differ from the nodepositions in the first portion of the uniform grid.
 34. The computerreadable medium of claim 30, wherein a first one of the particle typescomprises a molecule having a plurality of constituent atoms, andwherein assigning exactly one particle of the body to each of the nodescomprises assigning one instance of the molecule to each of a number ofthe nodes.
 35. The computer readable medium of claim 30, wherein a firstportion of the grid is imposed on a portion of the body composedessentially of multiple instances of a first compound, the firstcompound having a plurality of constituent elements in a particularratio, and wherein assigning exactly one particle of the body to each ofthe nodes comprises assigning the constituent elements individually tothe nodes in the first portion of the grid in the same proportion as theparticular ratio.
 36. The computer readable medium of claim 30, whereina first portion of the grid is imposed on a portion of the body composedessentially of a mixture of particles of a plurality of types inrespective particle ratios, and wherein assigning exactly one particleof the body to each of the nodes comprises assigning the particles ofthe mixture individually to the nodes in the first portion of the gridin the same proportions as in the mixture.
 37. The computer readablemedium of claim 30, wherein the code portions further define logic forreporting to a user values determined for the subset of physicalquantities at one or more nodes in the grid.
 38. A system for simulatinga temporal process in a body, comprising: means for imposing a uniformgrid of nodes on the body, the grid having three independent dimensionsand having a uniform node spacing which is less than the quantumseparation distance in silicon; means for providing a system of nodeequations, including at least one node equation for each of a pluralityof nodes of the grid, the node equation or equations for each particularone of the nodes describing behavior of at least one physical quantityof the body at the particular node through each of a first plurality oftime steps of the process; and means for iterating through the firstplurality of the time steps to determine values for at least a subset ofthe physical quantities of the body at the end of the first plurality oftime steps.
 39. The system of claim 38, wherein the temporal processcomprises a semiconductor fabrication process step.
 40. The system ofclaim 38, wherein the temporal process comprises charge movement in asemiconductor material.
 41. The system of claim 38, wherein the uniformnode spacing is a value that is within 10% of 0.27 nanometers.
 42. Thesystem of claim 41, wherein the uniform node spacing is 0.27 nanometers.43. The system of claim 38, wherein the three independent dimensions aremutually orthogonal.
 44. The system of claim 38, wherein the system ofnode equations includes a system of discrete time probability equations,and wherein the means for iterating through a first plurality of timesteps comprises means for, at each time step in the first plurality oftime steps, randomly determining a particle quantity change at eachparticular one of the nodes in the plurality of nodes in accordance withthe probability equation for the particular node.
 45. The system ofclaim 44, wherein the plurality of nodes of the grid includes all nodesof the grid.
 46. The system of claim 44, wherein the system of nodeequations further includes a system of discrete time continuityequations, at least one of the discrete time continuity equations foreach node of the grid, further comprising means for iterating through asecond plurality of the time steps, and at each time step in the secondplurality of time steps, solving the system of continuity equations as aset of simultaneous equations.
 47. The system of claim 38, wherein thesystem of node equations includes a system of first node equations eachdescribing behavior of a first physical quantity of the body at each ofthe nodes in the plurality of nodes through each time step in the firstplurality of time steps, and a system of second node equations eachdescribing behavior of a second physical quantity of the body at each ofthe nodes in a second plurality of the nodes of the grid through eachtime step in a second plurality of time steps of the process, each ofthe first node equations being dependent upon values of the secondphysical quantity and each of the second node equations being dependentupon values of the first physical quantity, further comprising means foriterating through the second plurality of the time steps to determinevalues for the second physical quantity of the body at the end of asecond plurality of time steps.
 48. The system of claim 47, wherein atleast one of the time steps in the second plurality of time stepsdiffers from all of the time steps in the first plurality of time steps.49. The system of claim 47, wherein the second plurality of time stepsis interspersed with the first plurality of time steps, and wherein theiteration through the second plurality of time steps alternates with theiteration through the first plurality of time steps.
 50. The system ofclaim 47, wherein the system of first node equations comprises a systemof discrete time continuity equations, at least one of the discrete timecontinuity equations for each node of the grid, and wherein the systemof second node equations comprises a system of discrete time probabilityequations, at least one of the discrete time probability equations foreach node of the grid.
 51. The system of claim 38, wherein the bodycomprises a plurality of different particle types, each having differentvalues for at least a first material property, at least one of the nodeequations being dependent upon the value for the first material propertyat each of the nodes, and wherein the means for imposing a uniform gridof nodes on the body comprises means for assigning exactly one particleof the body to each of the nodes.
 52. The system of claim 51, wherein afirst portion of the grid is imposed on a first portion of the body, thefirst portion of the body having particles disposed in a crystal latticestructure whose node positions differ from the node positions in thefirst portion of the uniform grid.
 53. The system of claim 51, wherein afirst one of the particle types comprises a molecule having a pluralityof constituent atoms, and wherein the means for assigning exactly oneparticle of the body to each of the nodes comprises means for assigningone instance of the molecule to each of a number of the nodes.
 54. Thesystem of claim 51, wherein a first portion of the grid is imposed on aportion of the body composed essentially of multiple instances of afirst compound, the first compound having a plurality of constituentelements in a particular ratio, and wherein the means for assigningexactly one particle of the body to each of the nodes comprises meansfor assigning the constituent elements individually to the nodes in thefirst portion of the grid in the same proportion as the particularratio.
 55. The system of claim 51, wherein a first portion of the gridis imposed on a portion of the body composed essentially of a mixture ofparticles of a plurality of types in respective particle ratios, andwherein the means for assigning exactly one particle of the body to eachof the nodes comprises means for assigning the particles of the mixtureindividually to the nodes in the first portion of the grid in the sameproportions as in the mixture.
 56. The system of claim 38, furthercomprising reporting means for reporting to a user values determined forthe subset of physical quantities at one or more nodes in the grid. 57.A system for simulating a temporal process in a body, the bodycomprising particles of a plurality of different particle types eachhaving a different value for at least a first material property,comprising: means for assigning exactly one particle of the body to eachof a plurality of nodes in a uniform grid of nodes imposed on the body,the grid having three independent dimensions and having a uniform nodespacing; means for providing a system of discrete time probability nodeequations, at least one of the node equations for each of the pluralityof nodes of the grid, each of the node equations describing probabilityof a predetermined physical event type occurring at the respective nodeof the grid during a predetermined time period, in dependence upon thevalue for the first material property of the particle assigned to therespective node; and means for iterating through a first plurality oftime steps in a simulation period, at each time step determining aphysical quantity of the body at each of the nodes in the plurality ofnodes at the end of the particular time step in dependence upon the nodeequations and values of the physical quantity at the beginning of theparticular time step, to determine values for the physical quantity ofthe body at the end of the simulation period.
 58. The system of claim57, wherein a first one of the particle types comprises a moleculehaving a plurality of constituent atoms, and wherein the means forassigning exactly one particle of the body to each of the nodescomprises means for assigning one instance of the molecule to each of anumber of the nodes.
 59. The system of claim 57, wherein a first portionof the grid is imposed on a portion of the body composed essentially ofmultiple instances of a first compound, the first compound having aplurality of constituent elements in a particular ratio, and wherein themeans for assigning exactly one particle of the body to each of thenodes comprises means for assigning the constituent elements to thenodes in the first portion of the grid in the same proportion as theparticular ratio.
 60. The system of claim 57, wherein a first portion ofthe grid is imposed on a portion of the body composed essentially of amixture of particles of a plurality of types in respective particleratios, and wherein the means for assigning exactly one particle of thebody to each of the nodes comprises means for assigning the particles ofthe mixture to the nodes in the first portion of the grid in the sameproportions as in the mixture.
 61. The system of claim 57, wherein afirst portion of the grid is imposed on a first portion of the body, thefirst portion of the body having particles disposed in a crystal latticestructure whose node positions differ from the node positions in thefirst portion of the uniform grid.
 62. The system of claim 61, whereinthe means for assigning exactly one particle of the body to each nodecomprises means for storing, accessibly to a computer system, inassociation with each node in the first portion of the grid, anidentification of an actual position in the body of the particleassigned to the respective node of the grid.
 63. The system of claim 62,wherein one of the node equations is dependent upon a distance to anadjacent particle, and wherein the means for iterating through a firsttime step in the first plurality of time steps the iterating module, forthe node equation corresponding to a first one of the nodes of the grid,approximates the distance to an adjacent particle as the distancebetween the first node and the grid node to which the adjacent particleis assigned.
 64. The system of claim 62, wherein one of the nodeequations is dependent upon a distance to an adjacent particle, andwherein the means for iterating through a first time step in the firstplurality of time steps the iterating module, for the node equationcorresponding to a first one of the nodes of the grid, determines thedistance to an adjacent particle in dependence upon the actual particlepositions as stored in association with the first node and the grid nodeto which the adjacent particle is assigned.
 65. The system of claim 62,wherein one of the node equations is dependent upon a distance to anadjacent particle, and wherein the means for iterating through a firsttime step in the first plurality of time steps comprises means for:determining, for the node equation corresponding to each given node inat least a subset of the grid nodes, whether the given node is within apredetermined boundary neighborhood of a material boundary; if the givennode is within the predetermined boundary neighborhood of a materialboundary, for the node equation corresponding to the given node,determining the distance to an adjacent particle in dependence upon theactual particle positions as stored in association with the given nodeand the node to which the adjacent particle is assigned; and if thegiven node is not within the predetermined boundary neighborhood, forthe node equation corresponding to the given node, approximating thedistance to the adjacent particle as the distance between the given nodeand the grid node to which the adjacent particle is assigned.
 66. Thesystem of claim 57, further comprising reporting means for reporting toa user values determined for the subset of physical quantities at one ormore nodes in the grid.
 67. A system for simulating a temporal processin a body having a plurality of different particle types, each particletype having different values for at least a first material property, thelogic comprising: means for imposing a uniform grid of nodes on thebody, including assigning exactly one particle of the body to each ofthe nodes, the grid having three independent dimensions and having auniform node spacing; means for providing a system of node equations,including at least one node equation for each of a plurality of nodes ofthe grid, the node equation or equations for each particular one of thenodes describing behavior of at least one physical quantity of the bodyat the particular node in dependence upon the value for the firstmaterial property at the particular node through each of a firstplurality of time steps of the process; and means for iterating throughthe first plurality of the time steps to determine values for at least asubset of the physical quantities of the body at the end of the firstplurality of time steps.
 68. The system of claim 67, wherein the meansfor iterating through a first plurality of time steps comprises meansfor, for a subject one of the time steps in the first plurality of timesteps: determining a particle quantity change at one or more nodes ofthe grid in a neighborhood of a subject one of the nodes of the grid;and re-assigning to the subject node a particle of the body selected independence upon the particle quantity changes.
 69. The system of claim67, wherein the node equations for each of the plurality of nodes of thegrid are discrete time probability equations describing probability of apredetermined physical event type occurring at the respective node ofthe grid during a predetermined time period, the predetermined physicalevent type causing a particle quantity change at one or more nodes ofthe grid.
 70. The system of claim 67, wherein a first portion of thegrid is imposed on a first portion of the body, the first portion of thebody having particles disposed in a crystal lattice structure whose nodepositions differ from the node positions in the first portion of theuniform grid.
 71. The system of claim 67, wherein a first one of theparticle types comprises a molecule having a plurality of constituentatoms, and wherein the means for assigning exactly one particle of thebody to each of the nodes comprises means for assigning one instance ofthe molecule to each of a number of the nodes.
 72. The system of claim67, wherein a first portion of the grid is imposed on a portion of thebody composed essentially of multiple instances of a first compound, thefirst compound having a plurality of constituent elements in aparticular ratio, and wherein the means for assigning exactly oneparticle of the body to each of the nodes comprises means for assigningthe constituent elements individually to the nodes in the first portionof the grid in the same proportion as the particular ratio.
 73. Thesystem of claim 67, wherein a first portion of the grid is imposed on aportion of the body composed essentially of a mixture of particles of aplurality of types in respective particle ratios, and wherein the meansfor assigning exactly one particle of the body to each of the nodescomprises means for assigning the particles of the mixture individuallyto the nodes in the first portion of the grid in the same proportions asin the mixture.
 74. The system of claim 67, further comprising means forreporting to a user values determined for the subset of physicalquantities at one or more nodes in the grid.